An atlas of limit set dynamics for asynchronous elementary cellular automata
نویسندگان
چکیده
منابع مشابه
Undecidable Properties of Limit Set Dynamics of Cellular Automata
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial properties of limit sets are undecidable. In this paper we consider properties of limit set dynamics, i.e. properties of the dynamics of Cellular Automata restric...
متن کاملSet-theoretic Reconstructability of Elementary Cellular Automata
This paper reports a study of elementary cellular automata (ECA), using the settheoretic reconstructability analysis (SRA) methods of Klir (1985), Conant (1981), Broekstra (1979) , and others. Cellular automata (CA) are discrete dynamic systems, de ned in terms of mappings of qualitative variables, which exhibit the same dynamic behaviors { including chaos { seen in systems of continuous di ere...
متن کاملDynamics groups of asynchronous cellular automata
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is π-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible 22 3...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملCellular Automata Reversible Over Limit Set
Reversibility is a widely accepted principle in physics, according to which, the microscopic laws governing the dynamics of the physical nature can hypothetically be reversed to let the system run backward in time. Reversible cellular automata (CA) have been extensively studied as convenient tools for modeling physical systems, whenever capturing the microscopic reversibility is desirable (see ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.015